#include<iostream>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
int a[N];
LL n, k;
int main()
{
	cin >> n >> k;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	LL left = 0, right = 1e8;
	while(left < right)
	{
		LL mid = left + (right - left + 1) / 2;
		LL c = 0;
		for(int i = 1; i <= n; i++)
		{
			c += a[i] / mid;
		}
		if(c >= k) left = mid;
		else right = mid - 1;
	}
	cout << left << endl;
	return 0;
} 
